The Order Convergence of Martingales Indexed by Directed sets
نویسندگان
چکیده
منابع مشابه
Uniform Convergence of Reversed Martingales
A necessary and sufficient condition for the uniform convergence of a family of reversed martingales converging to a degenerated limiting process is given. The condition is expressed by means of regular convergence (in Hardy’s sense) of corresponding means. It is shown that the given regular convergence is equivalent to Hoffmann-Jørgensen’s eventually total boundedness in the mean which is nece...
متن کاملcontrol of the optical properties of nanoparticles by laser fields
در این پایان نامه، درهمتنیدگی بین یک سیستم نقطه کوانتومی دوگانه(مولکول نقطه کوانتومی) و میدان مورد مطالعه قرار گرفته است. از آنتروپی ون نیومن به عنوان ابزاری برای بررسی درهمتنیدگی بین اتم و میدان استفاده شده و تاثیر پارامترهای مختلف، نظیر تونل زنی(که توسط تغییر ولتاژ ایجاد می شود)، شدت میدان و نسبت دو گسیل خودبخودی بر رفتار درجه درهمتنیدگی سیستم بررسی شده اشت.با تغییر هر یک از این پارامترها، در...
15 صفحه اولstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Weak convergence of empirical copula processes indexed by functions
DRAGAN RADULOVIĆ1, MARTEN WEGKAMP2 and YUE ZHAO3 1Department of Mathematics, Florida Atlantic University, 777 Glades Road, Boca Raton, FL 33431, USA. E-mail: [email protected] 2Department of Mathematics and Department of Statistical Science, Cornell University, 432 Malott Hall, Ithaca, NY 14853, USA. E-mail: [email protected] 3Department of Statistical Science, Cornell University, 310 M...
متن کاملFinger Indexed Sets: New Approaches
In the particular case we have insertions/deletions at the tail of a given set S of n one-dimensional elements, we present a simpler and more concrete algorithm than that presented in [Anderson, 2007] achieving the same (but also amortized) upper bound ofO( √ logd/loglogd) for finger searching queries, where d is the number of sorted keys between the finger element and the target element we are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1981
ISSN: 0002-9947
DOI: 10.2307/1999746